Receiver Oriented Trajectory Based Forwarding
نویسندگان
چکیده
Trajectory Based Forwarding (TBF) is a new approach to routing in ad hoc wireless networks. It exploits node position information and, similarly to source routing, requires the source node to encode a trajectory into the packet header. The routing process does not require to specify forwarding nodes. As a matter of fact, forwarding nodes are dynamically selected while packets cross the network according to their position with respect to the trajectory. Therefore, this new approach is particularly suitable for application scenarios where network topology is fast varying, due to node mobility (e.g. inter-vehicular networks) or to energy management schemes (e.g. sensor networks), whereas the stability of the trajectories is guaranteed by the physical characteristics of the service area (roads, building aisles, etc.). This paper describes a new TBF scheme that shifts forwarding decision from transmitter to receiver exploiting broadcast transmissions. We thoroughly analyze the behavior and the properties of the proposed scheme considering the impact of the medium access control mechanism and the effect of limited transmission ranges. We consider piecewise lines connecting source node to destination area and we extend the approach to the multicast case by defining trajectory-trees. Moreover, we propose a forwarding mechanism able to walk around obstacles along the trajectory.
منابع مشابه
GPS Jamming Detection in UAV Navigation Using Visual Odometry and HOD Trajectory Descriptor
Auto-navigating of unmanned aerial vehicles (UAV) in the outdoor environment is performed by using the Global positioning system (GPS) receiver. The power of the GPS signal on the earth surface is very low. This can affect the performance of GPS receivers in the environments contaminated with the other source of radio frequency interference (RFI). GPS jamming and spoofing are the most serious a...
متن کاملTrajectory-Based Forwarding Mechanisms for Ad-Hoc Sensor Networks
Routing in ad-hoc sensor networks is a complicated task because of many reasons. The nodes are low powered and they cannot maintain routing tables large enough for well-known routing protocols. Because of that, greedy forwarding at intermediate nodes is desirable in ad-hoc networks. Also, for traffic engineering, multipath capabilities are important. So, it is desirable to define routes at the ...
متن کاملTrajectory ⁃ Based Data Forwarding Schemes for Vehicular Networks
This paper explains trajectory⁃based data forwarding schemes for multihop data delivery in vehicular networks where the trajectory is the GPS navigation path for driving in a road network. Nowadays, GPS⁃based navigation is popular with drivers either for efficient driv⁃ ing in unfamiliar road networks or for a better route, even in familiar road networks with heavy traffic. In this paper, we de...
متن کاملVehicle Trajectory-Based Data Forwarding Schemes for Vehicular Ad Hoc Networks
This paper introduces three vehicle trajectory-based data forwarding schemes, tailored for vehicular ad hoc networks. Nowadays GPS-based navigation systems are popularly used for providing efficient driving paths for drivers. With the driving paths called vehicle trajectories, we can make data forwarding schemes more efficient, considering the micro-scoped mobility of individual vehicles in roa...
متن کاملCurve-Based Greedy Routing Algorithm for Sensor Networks
Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in implementing many networking functions when standard bootstrapping or configuration services are not available, as will be the case in sensor networks where nodes are thrown or dropped to form a one-time use network....
متن کامل